Geodesic-pancyclic graphs
نویسندگان
چکیده
A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v, denoted by dG(u, v), is the number of edges in a u-v geodesic. A graph G with n vertices is geodesic-pancyclic if for each pair of vertices u, v ∈ V (G), every u-v geodesic lies on every cycle of length k satisfying max{2dG(u, v), 3} ≤ k ≤ n. In this paper, we study the properties for graphs to be geodesic-pancyclic. In particular, we show that some sufficient conditions for panconnected graphs still suffice for geodesicpancyclic graphs. Keyword: Hamiltonian; Panconnected; Pancyclic; Vertex-pancyclic; Edge-pancyclic; Geodesic-pancyclic ∗All correspondence should be addressed to Professor Yue–Li Wang, Department of Computer Science and Information Engineering, National Chi Nan University, University Rd. Puli, Nantou Hsien, Taiwan 545 Republic of China (Email: [email protected]).
منابع مشابه
Geodesic pancyclicity of crossed cubes
For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a shortest path of G joining u and v lies on the cycle. A graph G is pancyclic [12] if it contains a cycle of every length from 3 to |V (G)| inclusive. Furthermore, a graph G is called geodesic k-pancyclic [3] if for each pair of vertices u, v ∈ V (G), it contains a geodesic cycle of every integer length of ...
متن کاملOptimal geodesic cycles embedding of Möbius cubes
For two vertices X,Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shortest path joining X and Y lies on the cycle. A graph G is called to be geodesic k-pancyclic if any two vertices X,Y on G have such geodesic cycle of length l that 2dG(X,Y ) + k ≤ l ≤ |V (G)|. In this paper, we show that the n-dimensional Möbius cube MQn is geodesic 2-pancyclic for n ≥ 3. This result is optima...
متن کاملA note on uniquely pancyclic graphs
In this paper we consider uniquely pancyclic graphs, i.e. n vertex graphs with exactly one cycle of each length from 3 to n. The first result of the paper gives new upper and lower bounds on the number of edges in a uniquely pancyclic graph. Next we report on a computer search for new uniquely pancyclic graphs. We found that there are no new such graphs on n ≤ 59 vertices and that there are no ...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملStrongly pancyclic and dual-pancyclic graphs
Say that a cycle C almost contains a cycle C− if every edge except one of C− is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C− and every nonspanning cycle C is almost contained in another cycle C. This is equivalent to requiring, in addition, that the sizes of C− and C differ by one from the size of C. Strongly pancyclic graphs ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007